Polyhedral Analysis for Concentrator Location Problems
نویسندگان
چکیده
منابع مشابه
Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems
We study the polyhedral structure of two primal relaxations of a class of specially structured mixed integer programming problems. This class includes the generalized capacitated plant location problem and a production scheduling problem as special cases. We show that for this class of problems two polyhedra constructed from the constraint sets in two difl‘erent primal relaxations are identical...
متن کاملPlanar Location Problems with Barriers under Polyhedral Gauges
The Weber problem for a given nite set of existing facilities Ex = fEx 1 ; Ex 2 ; : : : ; Ex M g IR 2 with positive weights w m (m = 1; : : : ; M) is to nd a new facility X 2 IR 2 such that P M m=1 w m d(X; Ex m) is minimized for some distance function d. In this paper we consider distances deened by polyhedral gauges. A variation of this problem is obtained if barriers are introduced which are...
متن کاملFacility Location Problems: Approximation Algorithms and Polyhedral Results
Het onderzoek beschreven in dit proefschrift is mede gefinancierd door de Technische Uni-versiteit Delft (TUDelft) and China Scholarship Council (CSC) Acknowledgements I have had a wonderful time during the past four years as a PhD student at TU Delft. This has been one of the most significant periods in my life, and would not have been possible without the support of my colleagues and friends....
متن کاملAdapting polyhedral properties from facility to hub location problems
We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the elds of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some classes of facets for this polyhedron. We develop a general rule about lifting facets from the uncapac...
متن کاملPolyhedral results for assignment problems
This paper introduces an Integer Programming model for multidimensional assignment problems and examines the underlying polytopes. It also proposes a certain hierarchy among assignment polytopes. The dimension for classes of multidimensional assignment polytopes is established, unifying and generalising previous results. The framework introduced constitutes the first step towards a polyhedral c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2006
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-005-3913-y